Clique Detection as a Royal Road Function
نویسنده
چکیده
Royal Road functions manipulate the t-ness landscape to provide controlled experiments into genetic algorithm (GA) theory Mitchell et al., 1992]. Variations of clique detection in a graph, e.g., nding both the max clique Soule et al., 1996] and the clique cover Haynes, 1996], have been proposed as naturally occurring Royal Road functions. Soule and Foster have tried to positively correlate diierent graph families to various measures of GA hardness Soule and Foster, 1997]. We present a systematic approach to determining the relevant characteristics. We investigate graphs for which simple search algorithms, e.g., random search, hill climbing, and simulated annealing, should easily determine both the max clique and the clique cover.
منابع مشابه
Phenotypical Building Blocks for Genetic Programming
The theoretical foundations of genetic algorithms (GA) rest on the shoulders of the Schema Theorem, which states that the building blocks, highly t compact subsets of the chromosome, are more likely to survive from one generation to the next. The theory of genetic programming (GP) is tenuous , borrowing heavily from that of GA. As the GP can be considered to be a GA operating on a tree structur...
متن کاملLower bounds on the signed (total) $k$-domination number
Let $G$ be a graph with vertex set $V(G)$. For any integer $kge 1$, a signed (total) $k$-dominating functionis a function $f: V(G) rightarrow { -1, 1}$ satisfying $sum_{xin N[v]}f(x)ge k$ ($sum_{xin N(v)}f(x)ge k$)for every $vin V(G)$, where $N(v)$ is the neighborhood of $v$ and $N[v]=N(v)cup{v}$. The minimum of the values$sum_{vin V(G)}f(v)$, taken over all signed (total) $k$-dominating functi...
متن کاملThe Cooperative Royal Road: Avoiding Hitchhiking
We propose using the so called Royal Road functions as test functions for cooperative co-evolutionary algorithms (CCEAs). The Royal Road functions were created in the early 90’s with the aim of demonstrating the superiority of genetic algorithms over local search methods. Unexpectedly, the opposite was found to be true. The research deepened our understanding of the phenomenon of hitchhiking wh...
متن کاملCooperative Royal Road: avoiding hitchhiking
We propose using the so called Royal Road functions as test functions for cooperative co-evolutionary algorithms (CCEAs). The Royal Road functions were created in the early 90’s with the aim of demonstrating the superiority of GAs over local search methods. Unexpectedly, the opposite was found true, but this research conducted to understanding the phenomenon of hitchhiking whereby unfavorable a...
متن کاملMarkov Dynamics as a Zooming Lens for Multiscale Community Detection: Non Clique-Like Communities and the Field-of-View Limit
In recent years, there has been a surge of interest in community detection algorithms for complex networks. A variety of computational heuristics, some with a long history, have been proposed for the identification of communities or, alternatively, of good graph partitions. In most cases, the algorithms maximize a particular objective function, thereby finding the 'right' split into communities...
متن کامل